Convexity Properties in Binary Detection Problems - Information Theory, IEEE Transactions on
نویسنده
چکیده
This correspondence investigates convexity properties of error probability in the detection of binary-valued scalar signals corrupted by additive noise. It is shown that the error probability of the maximumlikelihood receiver is a convex function of the signal power when the noise has a unimodal distribution. Based on this property, results on the optimal time-sharing strategies of transmitters and jammers, and on the optimal use of multiple channels are obtained.
منابع مشابه
Quasi-convexity and optimal binary fusion for distributed detection with identical sensors in generalized Gaussian noise
In this correspondence, we present a technique to find the optimal threshold for the binary hypothesis detection problem with identical and independent sensors. The sensors all use an identical and single threshold to make local decisions, and the fusion center makes a global decision based on the local binary decisions. For generalized Gaussian noises and some non-Gaussian noise distributions,...
متن کاملModelling and Experimental Testing of Asymmetric Information Problems in Lease and Hire Contracts (Based on Contract Theory)
This article aims to study lease and hiring contract in the Iranian-Islamic setting and analyze the asymmetric information problem in these contracts. For doing this, we study the characteristics of lease and hiring contracts in Iran (real world experimental characteristics that recognized in other studies), using library method, then we mathematically model different aspects of asymmetric info...
متن کاملDense Sphere Packings from New Codes
The idea behind the coset code construction (see [G.D. Forney, Coset Codes, IEEE Transactions on Information Theory, Part I: Introduction and Geometrical Classification, pp. 1123–1151; Part II: Binary lattices and related codes, pp. 1152–1187; F.R. Kschischang and S. Pasupathy, IEEE Transactions on Information Theory 38 (1992), 227–246.]) is to reduce the construction of sphere packings to erro...
متن کاملComments on "A New Method to Compute the 2-Adic Complexity of Binary Sequences"
We show that there is a very simple approach to determine the 2-adic complexity of periodic binary sequences with ideal two-level autocorrelation. This is the first main result by H. Xiong, L. Qu, and C. Li, IEEE Transactions on Information Theory, vol. 60, no. 4, pp. 2399-2406, Apr. 2014, and the main result by T. Tian and W. Qi, IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 450...
متن کاملComments on 'Generating and counting binary Bent sequences'
We prove that the conjecture on bent sequences stated in Generating and counting bent sequences IEEE Transactions on Information Theory IT No by C M Adams and S E Tavares is false Let Vn be the vector space of n tuples of elements from GF Any map from Vn to GF f can be uniquely written as a polynomial in coordinates x xn f x xn M
متن کامل